A Hamiltonian game on Kn,n
نویسندگان
چکیده
منابع مشابه
Hamiltonian Formulism of Game Theory
A new representation of Game Theory is developed in this paper. State of players is represented by a density matrix, and payoff function is a set of hermitian operators, which when applied onto the density matrix give the payoff of players. By this formulism, a new way to find the equilibria of games is given by generalizing the thermodynamical evolutionary process leading to equilibrium in Sta...
متن کاملHamiltonian Formalism of Game Theory
A new representation of Game Theory is developed in this paper. State of players is represented by a density matrix, and payoff function is a set of hermitian operators, which when applied onto the density matrix gives the payoff of players. By this formalism, a new way to find the equilibria of games is given by generalizing the thermodynamical evolutionary process leading to equilibrium in St...
متن کاملOn Two Problems Regarding the Hamiltonian Cycle Game
We consider the fair Hamiltonian cycle Maker-Breaker game, played on the edge set of the complete graph Kn on n vertices. It is known that Maker wins this game if n is sufficiently large. We are interested in the minimum number of moves needed for Maker in order to win the Hamiltonian cycle game, and in the smallest n for which Maker has a winning strategy for this game. We prove the following ...
متن کاملA Survey on Knn Odel Graphs
Knn odel graphs of even order n and degree 1 blog 2 (n)c, W;n, are graphs which have been introduced some 25 years ago as the topology underlying a time optimal algorithm for gossiping among n nodes Knn o75]. However, they have been formally deened only 5 years ago FP94]. Since then, they have been widely studied as interconnection networks, mainly because of their good properties in terms of b...
متن کاملA Note on Knn Odel Graphs
In this note, we show that the edges of the modiied Knn odel graph behave similarly to the dimensions in hypercubes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1995
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0218-s